Optimized Projection Matrix for Compressive Sensing
نویسندگان
چکیده
Compressive sensing (CS) is mainly concerned with low-coherence pairs, since the number of samples needed to recover the signal is proportional to the mutual coherence between projection matrix and sparsifying matrix. Until now, papers on CS always assume the projection matrix to be a random matrix. In this paper, aiming at minimizing the mutual coherence, a method is proposed to optimize the projection matrix. This method is based on equiangular tight frame (ETF) design because an ETF has minimum coherence. It is impossible to solve the problem exactly because of the complexity. Therefore, an alternating minimization type method is used to find a feasible solution. The optimally designed projection matrix can further reduce the necessary number of samples for recovery or improve the recovery accuracy. The proposed method demonstrates better performance than conventional optimization methods, which brings benefits to both basis pursuit and orthogonal matching pursuit.
منابع مشابه
Asynchronous Compressive Radar
A low-power asynchronous compressive sensing scheme is proposed for radar. Power and design cost are optimized by combining asynchronous sampling and compressive sensing which decreases both the duty cycle of front-end circuits and the data volume of the ADC interface. In the signal reconstruction stage, a lowcomplexity noise-robust split-projection least squares (SPLS) is proposed.
متن کاملAn Optimized Toeplitz Measurement Matrix based on ANN for Compressive Sensing ⋆
Compressive sensing takes advantage of the signals in some domain, allowing the entire signal to efficiently acquired and reconstructed from relatively few measurements. Toeplitz matrix has more advantages in the amount of data and computation over Gaussian random matrix, but its far from Gaussian matrix in the performance of signal reconstruction. In this paper, Toeplitz matrix is employed and...
متن کاملConvergence of the Generalized Alternating Projection Algorithm for Compressive Sensing
The convergence of the generalized alternating projection (GAP) algorithm is studied in this paper to solve the compressive sensing problem y = Ax + . By assuming that AA> is invertible, we prove that GAP converges linearly within a certain range of step-size when the sensing matrix A satisfies restricted isometry property (RIP) condition of δ2K , where K is the sparsity of x. The theoretical a...
متن کاملPrecomputed Compressive Sensing for Light Transport Acquisition
In this article, we propose an efficient and accurate compressive-sensing-based method for estimating the light transport characteristics of real-world scenes. Although compressive sensing allows the efficient estimation of a high-dimensional signal with a sparse or near-to-sparse representation from a small number of samples, the computational cost of the compressive sensing in estimating the ...
متن کاملRobust Projection Matrix Design and Its Application in Compression
The aim of this brief is to design a robust projection matrix for the Compressive Sensing (CS) system when the signal is not exactly sparse. The optimal projection matrix design is obtained by minimizing the Frobenius norm of the difference between the identity matrix and the Gram matrix of the equivalent dictionary ΦΨ. A novel penalty ‖Φ‖F is added to make the projection matrix robust when the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Adv. Sig. Proc.
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010